0 M ay 2 00 2 There are no iterated morphisms that define the Arshon sequence and the σ - sequence Sergey Kitaev 1 st February 2008
نویسنده
چکیده
In [3], Berstel proved that the Arshon sequence cannot be obtained by iteration of a morphism. An alternative proof of this fact is given here. The σ-sequence was constructed by Evdokimov in order to construct chains of maximal length in the n-dimensional unit cube. It turns out that the σ-sequence has a close connection to the Dragon curve [8]. We prove that the σ-sequence can not be defined by iteration of a morphism.
منابع مشابه
No iterated morphism generates any Arshon sequence of odd order
We show that no Arshon sequence of odd order can be generated by an iterated morphism. This solves a problem of Kitaev and generalizes results of Berstel and of Kitaev.
متن کاملOn combinatorial properties of the Arshon sequence
We consider combinatorial and algebraic properties of the language of factors of the in+nite sequence on the three-letter alphabet built by S.E. Arshon in 1930s. This sequence never contains two successive equal words, i. e., avoids the number 2. The notion of avoidability is extended from integers to rational numbers. It is shown that the avoidability bound for the considered language is 4 . T...
متن کاملar X iv : a st ro - p h / 05 05 49 4 v 1 2 4 M ay 2 00 5 The Limits
We present evidence that the simplest particle-physics scalar-field models of dynamical dark energy can be separated into distinct behaviors based on the acceleration or deceleration of the field as it evolves down its potential towards a zero minimum. We show that these models occupy narrow regions in the phase-plane of w and w′, the dark energy equation-of-state and its time-derivative in uni...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کامل6 M ay 2 00 7 SIMPLY CONNECTED MINIMAL SYMPLECTIC 4 - MANIFOLDS WITH SIGNATURE LESS THAN – 1
For each pair (e, σ) of integers satisfying 2e + 3σ ≥ 0, σ ≤ −2, and e + σ ≡ 0 (mod 4), with four exceptions, we construct a minimal, simply connected symplectic 4-manifold with Euler characteristic e and signature σ. We also produce simply connected, minimal symplectic 4-manifolds with signature zero (resp. signature −1) with Euler characteristic 4k (resp. 4k + 1) for all k ≥ 46 (resp. k ≥ 49).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002